Linear Complexity of Some Binary Interleaved Sequences of Period 4N
نویسندگان
چکیده
It is necessary that the linear complexity of a key stream sequence in a stream cipher system is not less than half of a period. This paper puts forward the linear complexity of a class of binary interleaved sequences with period 4N over the finite field with characteristic 2. Results show that the linear complexity of some of these sequences satisfies the requirements of cryptography.
منابع مشابه
Linear Complexity and Autocorrelation of two Classes of New Interleaved Sequences of Period 2N
The autocorrelation and the linear complexity of a key stream sequence in a stream cipher are important cryptographic properties. Many sequences with these good properties have interleaved structure, three classes of binary sequences of period 4N with optimal autocorrelation values have been constructed by Tang and Gong based on interleaving certain kinds of sequences of period N . In this pape...
متن کاملNew Constructions of Binary Interleaved Sequences with Low Autocorrelation
The autocorrelation of a key stream sequence in a stream cipher is an important cryptographic property. This paper proposes two constructions of binary interleaved sequences of period 4N by selecting appropriate shift sequences, subsequences and complement sequences. And the autocorrelation functions of new sequences are given. The results show that these sequences have low autocorrelation unde...
متن کاملInterleaved Sequences of Geometric Sequences Binarized with Legendre Symbol of Two Types
A pseudorandom number generator is widely used in cryptography. A cryptographic pseudorandom number generator is required to generate pseudorandom numbers which have good statistical properties as well as unpredictability. An m-sequence is a linear feedback shift register sequence with maximal period over a finite field. M-sequences have good statistical properties, however we must nonlinearize...
متن کاملThe Linear Complexity of a Class of Binary Sequences With Optimal Autocorrelation
Binary sequences with optimal autocorrelation and large linear complexity have important applications in cryptography and communications. Very recently, a class of binary sequences of period 4p with optimal autocorrelation was proposed by interleaving four suitable Ding-Helleseth-Lam sequences (Des. Codes Cryptogr., DOI 10.1007/s10623-017-0398-5), where p is an odd prime with p ≡ 1( mod 4). The...
متن کاملFamilies of p-ary sequences with low correlation and large linear complexity
This paper generalizes a method of generating shift sequences in the interleaved construction proposed by Gong. With the new shift sequences, some new families of p-ary sequences with desired properties can be obtained. A lower bound on the number of new families of binary sequences is also established.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- I. J. Network Security
دوره 18 شماره
صفحات -
تاریخ انتشار 2016